Chain addition cycles
نویسندگان
چکیده
منابع مشابه
Edge Addition Number of Cartesian Product of Paths and Cycles
Graph bandwidth problem has been studies for over forty years. The relation between the bandwidth and number of edges in the graph is always interesting. The edge addition number ad(G) of a graph is the minimum number of edges that added into the graph G which cause the resulting graph’s bandwidth greater than the bandwidth of G. This paper determines the edge addition number for the Cartesian ...
متن کاملSPA Resistant Scalar Multiplication using Golden Ratio Addition Chain Method
In this paper we propose an efficient and secure (SPA resistant) elliptic curve scalar multiplication algorithm over odd prime fields. For this purpose, we propose an explicit algorithm for short addition-subtraction chain method which utilizes a golden ratio. We term it as golden ratio addition chain method or GRAC method in short. Our proposed scalar multiplication algorithm based over GRAC m...
متن کاملGeneration of Addition Chain using Deterministic Division Based Method
Efficiency of a cryptosystem depends not only on the security it provides, but also it increases the operational speed thereby it reduces the time taken for encryption and decryption. In most numbertheoretic cryptographic algorithms like RSA, ElGamal, Massey-Omura etc., the encryption and decryption functions often involve raising large elements (x mod n) of group fields GF(2) or large powers (...
متن کاملSecuring RSA against Fault Analysis by Double Addition Chain Exponentiation
Fault Analysis is a powerful cryptanalytic technique that enables to break cryptographic implementations embedded in portable devices more efficiently than any other technique. For an RSA implemented with the Chinese Remainder Theorem method, one faulty execution suffices to factorize the public modulus and fully recover the private key. It is therefore mandatory to protect embedded implementat...
متن کاملExploiting Collisions in Addition Chain-based Exponentiation Algorithms
Public key cryptographic algorithms are typically based on group exponentiation algorithms, and many algorithms have been proposed in the literature based on addition chains. We describe attacks based on collisions of variables manipulated in group operations extending attacks described in the literature. These collisions are visible where one is able to acquire information through some suitabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2003
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(02)00512-8